Sample Complexity of Sample Average Approximation for Conditional Stochastic Optimization
نویسندگان
چکیده
منابع مشابه
The Sample Average Approximation Method for 2-stage Stochastic Optimization
We consider the Sample Average Approximation (SAA) method for 2-stage stochastic optimization problems with recourse and prove a polynomial time convergence theorem for the SAA method. In the 2-stage recourse model, where one makes decisions in two steps. First, given only distributional information about (some of) the data, one commits on initial (first-stage) actions, and then once the actual...
متن کاملSample Average Approximation Method for Compound Stochastic Optimization Problems
The paper studies stochastic optimization (programming) problems with compound functions containing expectations and extreme values of other random functions as arguments. Compound functions arise in various applications. A typical example is a variance function of nonlinear outcomes. Other examples include stochastic minimax problems, econometric models with latent variables, multi-level and m...
متن کاملThe Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation–based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and the expected value function is approximated by the corresponding sample average function. The obtained sample average optimization problem is solved, and the procedure is repeated several times until a stopping crite...
متن کاملStochastic Multiobjective Optimization: Sample Average Approximation and Applications
We investigate one stage stochastic multiobjective optimization problems where the objectives are the expected values of random functions. Assuming that the closed form of the expected values is difficult to obtain, we apply the well known Sample Average Approximation (SAA) method to solve it. We propose a smoothing infinity norm scalarization approach to solve the SAA problem and analyse the c...
متن کاملSample Complexity of Smooth Stochastic Optimization∗
Let N( , δ) be the number of samples needed when solving a stochastic program such that the objective function evaluated at the sample optimizer is within of the true optimum with probability 1− δ. Previous results are of the form N( , δ) = O( −2 log δ−1). However, a smooth objective function is often locally quadratic at an interior optimum. For that case we use results on the convergence of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2020
ISSN: 1052-6234,1095-7189
DOI: 10.1137/19m1284865